(Hierarchical Identity-Based) Threshold Ring Signatures without Random Oracles
نویسندگان
چکیده
We construct the first several efficient threshold ring signatures (TRS) without random oracles. Specializing to a threshold of one, they are the first several efficient ring signatures without random oracles after the only earlier instantiation of Chow, Liu, Wei, and Yuen [22]. Further specializing to a ring of just one user, they are the short (ordinary) signatures without random oracles summarized in Wei and Yuen [41]. We also construct the first hierarchical identity-based threshold ring signature without random oracles. The signature size is O(nλs) bits, where λs is the security parameter and n is the number of users in the ring. Specializing to a threshold of one, it is the first hierarchical identity-based ring signature without random oracles. Further specializing to a ring of one user, it is the constant-size hierarchical identity-based signature (HIBS) without random oracles in [44] the signature size is O(λs) bits which is independent of the number of levels in the hierarchy.
منابع مشابه
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
We propose a variant of the “bonsai tree” signature scheme, a lattice-based existentially unforgeable signature scheme in the standard model. Our construction offers the same efficiency as the “bonsai tree” scheme but supports the stronger notion of strong unforgeability. Strong unforgeability demands that the adversary is unable to produce a new message-signature pair (m, s), even if he or she...
متن کاملA New ID-based Threshold Ring Signcryption without Random Oracles
Signcryption is a cryptographic primitive which could provide authentication and confidentiality simultaneously with a computational cost lower than signing and encryption respectively, while the ring signcryption has anonymity in addition to authentication and confidentiality. In order to design an identitybased threshold ring signcryption, this paper presented an efficient identity-based thre...
متن کاملEfficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
We construct two efficient Identity Based Encryption (IBE) systems that are selective identity secure without the random oracle model in groups equipped with a bilinear map. Selective identity secure IBE is a slightly weaker security model than the standard security model for IBE. In this model the adversary must commit ahead of time to the identity that it intends to attack, whereas in the sta...
متن کاملConstant-Size Hierarchical Identity-Based Signature/Signcryption without Random Oracles
We construct the first constant-size hierarchical identity-based signature (HIBS) without random oracles the signature size is O(λs) bits, where λs is the security parameter, and it is independent of the number of levels in the hierarchy. We observe that an efficient hierarchical identity-based signcryption (HIBSC) scheme without random oracles can be compositioned from our HIBS and Boneh, Boye...
متن کاملAn Expressive Attribute-based Signature Scheme without Random Oracles
Attribute-based signatures (ABS) is a new cryptographic primitive and can play a great role in attributebased access control systems. In ABS, a signer can choose its attributes satisfying a policy of a verifier to generate a valid signature without reveal its identity or attributes, while the signature assures that the message is endorsed by an individual owning attributes the policy requiring....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006